Design of Hyperelliptic Cryptosystems in Small Characteristic and a Software Implementation over F2n
نویسندگان
چکیده
We investigate the discrete logarithm problem over jacobians of hyperelliptic curves suitable for public-key cryptosystems. We focus on the case when the definition field has small characteristic 2, 3, 5 and 7, then we present hyperelliptic cryptosystems that resist against all known attacks. We further implement our designed hyperelliptic cryptosystems over finite fields F2n in software on Alpha and Pentium-II computers. Our results indicate that if we choose curves carefully, hyperelliptic cryptosystems do have practical performance.
منابع مشابه
Classification of genus 2 curves over F2n and optimization of their arithmetic
To obtain efficient cryptosystems based on hyperelliptic curves, we studied genus 2 isomorphism classes of hyperelliptic curves in characteristic 2. We found general and optimal form for these curves, just as the short Weierstrass form for elliptic curves. We studied the security and the arithmetic on their jacobian. We also rewrote and optimized the formulas of Lange in characteristic 2, and w...
متن کاملTate pairing computation on the divisors of hyperelliptic curves for cryptosystems
In recent papers [4], [9] they worked on hyperelliptic curves Hb defined by y +y = x+x+b over a finite field F2n with b = 0 or 1 for a secure and efficient pairing-based cryptosystems. We find a completely general method for computing the Tate-pairings over divisor class groups of the curves Hb in a very explicit way. In fact, Tate-pairing is defined over the entire divisor class group of a cur...
متن کاملEfficient Implementation of Genus Three Hyperelliptic Curve Cryptography over GF(2n)
The optimization of the Harley algorithm is an active area of hyperelliptic curve cryptography. We propose an efficient method for software implementation of genus three Harley algorithm over F2n . Our method is based on fast finite field multiplication using one SIMD operation, SSE2 on Pentium 4, and parallelized Harley algorithm. We demonstrated that software implementation using proposed met...
متن کاملComputing Zeta Functions of Hyperelliptic Curves over Finite Fields of Characteristic 2
We present an algorithm for computing the zeta function of an arbitrary hyperelliptic curve over a finite field Fq of characteristic 2, thereby extending the algorithm of Kedlaya for small odd characteristic. For a genus g hyperelliptic curve over F2n , the asymptotic running time of the algorithm is O(gn) and the space complexity is O(gn).
متن کاملSoftware Implementation of Genus-2 Hyperelliptic Curve Cryptosystems Over Prime Fields
This paper describes the system parameters and software implementation of a HECDSA cryptosystem based on genus-2 hyperelliptic curves over prime fields. We show how to reduce the computational complexity for special cases and compare the given cryptosystem with the well-known ECDSA cryptosystem based on elliptic curves.
متن کامل